Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints
نویسندگان
چکیده
منابع مشابه
A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy Demands
In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...
متن کاملA hybrid metaheuristic to solve the vehicle routing problem with stochastic demand and probabilistic duration constraints
The vehicle routing problem with stochastic demands and probabilistic distance constraints (VRPSD-PDC) can be defined on a complete and undirected graph G = (V, E), where V = {0, . . . , n} is the vertex set and E = {(v, u) : v, u ∈ V, v ̸= u} is the edge set. Vertices v = 1, . . . , n represent the customers and vertex v = 0 represents the depot. A distance de is associated with edge e = (v, u)...
متن کاملa hybrid heuristic algorithm to solve capacitated location-routing problem with fuzzy demands
in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...
متن کاملErratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
The article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two-dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delivery of the goods demanded by the customers, and carried out by a fleet of vehicles based at a central depot. In ...
متن کاملA Hybrid PSO-GA Approach to Solve Vehicle Routing Problem
The Vehicle Routing Problem can be expressed as the problem of designing optimal collection or delivery routes from one or multiple depots to a number of terrestrially scattered customers or cities, subject to side constraints such as time, capacity, mileage etc. The VRP plays a key role in the fields of logistics and transportation. There exist a number of variants of VRPs. Mostly VRPs with fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2020
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2019.8.002